Solving the Multiple Platforms Configuration Problem

نویسنده

  • D. Ben-Arieh
چکیده

The focus of manufacturing has been shifting from mass production to mass customization and producers are seeking ways to reduce production costs, still offering a competitive basket of products. One approach for implementing mass customization is to develop or produce products based on platform architecture. This paper proposes multiple platforms for the production of a given product family while minimizing the overall production cost. The methodology considers the demand for each product variant, with the decision variables as the optimal number of platforms, optimal configuration of each platform, and assignment of the products to the platforms. The problem is formulated as a mixed integer program, and both the optimal formulation and an evolutionary strategy based on Genetic Algorithm are presented. The approach is illustrated with an example from a family of cordless drills.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

متن کامل

Solving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops

A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...

متن کامل

An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem

The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...

متن کامل

Compilation and Assessment of a Model for the Correlations between Emotional Self-regulation and Social Problem-solving with Disease Perception and Resilient Mediation in Patients with Multiple Sclerosis in Tabriz, Iran

Objective: The present study aimed to assess the correlations between emotional self-regulation and problem-solving with disease perception through resilient mediation in patients with multiple sclerosis (MS) in Tabriz, Iran. Methodology: This study was carried out as structural equations on 250 MS patients in Tabriz in 2018, who completed emotional self-regulation, problem-solving, disease per...

متن کامل

Solving Multiple Fuels Dynamic Environmental/Economic Dispatch Problem and Incentive Based Demand Response Considering Spinning Reserve Requirements

In this paper a new integrated model of the dynamic environmental/economic dispatch (DEED) problem and emergency demand response program (EDRP) has been presented by which their interactions are investigated. DEED schedules the online generators power output over the whole dispatch period subject to some practical constraints so that the fuel costs and emission are optimized simultaneously. EDR...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007